TSTP Solution File: KRS272^7 by cvc5---1.0.5
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : cvc5---1.0.5
% Problem : KRS272^7 : TPTP v8.1.2. Released v5.5.0.
% Transfm : none
% Format : tptp
% Command : do_cvc5 %s %d
% Computer : n017.cluster.edu
% Model : x86_64 x86_64
% CPU : Intel(R) Xeon(R) CPU E5-2620 v4 2.10GHz
% Memory : 8042.1875MB
% OS : Linux 3.10.0-693.el7.x86_64
% CPULimit : 300s
% WCLimit : 300s
% DateTime : Thu Aug 31 05:42:00 EDT 2023
% Result : CounterSatisfiable 35.65s 36.30s
% Output : Assurance 0s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----No solution output by system
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.13 % Problem : KRS272^7 : TPTP v8.1.2. Released v5.5.0.
% 0.13/0.14 % Command : do_cvc5 %s %d
% 0.13/0.35 % Computer : n017.cluster.edu
% 0.13/0.35 % Model : x86_64 x86_64
% 0.13/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.35 % Memory : 8042.1875MB
% 0.13/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.35 % CPULimit : 300
% 0.13/0.35 % WCLimit : 300
% 0.13/0.35 % DateTime : Mon Aug 28 01:24:27 EDT 2023
% 0.13/0.35 % CPUTime :
% 0.19/0.48 %----Proving TH0
% 0.19/0.49 %------------------------------------------------------------------------------
% 0.19/0.49 % File : KRS272^7 : TPTP v8.1.2. Released v5.5.0.
% 0.19/0.49 % Domain : Knowledge Representation
% 0.19/0.49 % Problem : Generation of abstract instructions: enter a number in a(#box
% 0.19/0.49 % Version : [Ben12] axioms.
% 0.19/0.49 % English :
% 0.19/0.49
% 0.19/0.49 % Refs : [Sto00] Stone (2000), Towards a Computational Account of Knowl
% 0.19/0.49 % : [Ben12] Benzmueller (2012), Email to Geoff Sutcliffe
% 0.19/0.49 % Source : [Ben12]
% 0.19/0.49 % Names : s4-cumul-APM003+1 [Ben12]
% 0.19/0.49
% 0.19/0.49 % Status : Theorem
% 0.19/0.49 % Rating : 0.77 v8.1.0, 0.82 v7.5.0, 0.29 v7.4.0, 0.67 v7.3.0, 0.78 v7.2.0, 0.75 v7.1.0, 0.88 v7.0.0, 0.86 v6.4.0, 0.83 v6.3.0, 0.80 v6.2.0, 0.86 v5.5.0
% 0.19/0.49 % Syntax : Number of formulae : 86 ( 35 unt; 44 typ; 32 def)
% 0.19/0.49 % Number of atoms : 154 ( 36 equ; 0 cnn)
% 0.19/0.49 % Maximal formula atoms : 18 ( 3 avg)
% 0.19/0.49 % Number of connectives : 217 ( 5 ~; 5 |; 9 &; 188 @)
% 0.19/0.49 % ( 0 <=>; 10 =>; 0 <=; 0 <~>)
% 0.19/0.49 % Maximal formula depth : 20 ( 3 avg)
% 0.19/0.49 % Number of types : 3 ( 1 usr)
% 0.19/0.49 % Number of type conns : 198 ( 198 >; 0 *; 0 +; 0 <<)
% 0.19/0.49 % Number of symbols : 52 ( 50 usr; 10 con; 0-4 aty)
% 0.19/0.49 % Number of variables : 104 ( 61 ^; 36 !; 7 ?; 104 :)
% 0.19/0.49 % SPC : TH0_THM_EQU_NAR
% 0.19/0.49
% 0.19/0.49 % Comments :
% 0.19/0.49 %------------------------------------------------------------------------------
% 0.19/0.49 %----Include axioms for Modal logic S4 under cumulative domains
% 0.19/0.49 %------------------------------------------------------------------------------
% 0.19/0.49 %----Declaration of additional base type mu
% 0.19/0.49 thf(mu_type,type,
% 0.19/0.49 mu: $tType ).
% 0.19/0.49
% 0.19/0.49 %----Equality
% 0.19/0.49 thf(qmltpeq_type,type,
% 0.19/0.49 qmltpeq: mu > mu > $i > $o ).
% 0.19/0.49
% 0.19/0.49 % originale Definition
% 0.19/0.49 %thf(qmltpeq,definition,
% 0.19/0.49 % ( qmltpeq
% 0.19/0.49 % = ( ^ [X: mu,Y: mu,W: $i] : ( X = Y ) ) )).
% 0.19/0.49
% 0.19/0.49 % erweiterte Leibnitz-Definition
% 0.19/0.49 %thf(qmltpeq,definition,
% 0.19/0.49 % ( qmltpeq
% 0.19/0.49 % = ( ^ [X: mu,Y: mu,W: $i] : (![P: mu > $i > $o]: ( (P @ X @ W) <=> (P @ Y @ W) ) ) ) )).
% 0.19/0.49
% 0.19/0.49 % Leibnitz-Definition
% 0.19/0.49 %thf(qmltpeq,definition,
% 0.19/0.49 % ( qmltpeq
% 0.19/0.49 % = ( ^ [X: mu,Y: mu,W: $i] : (! [P: mu > $o]: ( (P @ X) <=> (P @ Y) ) ) ) )).
% 0.19/0.49
% 0.19/0.49 thf(meq_prop_type,type,
% 0.19/0.49 meq_prop: ( $i > $o ) > ( $i > $o ) > $i > $o ).
% 0.19/0.49
% 0.19/0.49 thf(meq_prop,definition,
% 0.19/0.49 ( meq_prop
% 0.19/0.49 = ( ^ [X: $i > $o,Y: $i > $o,W: $i] :
% 0.19/0.49 ( ( X @ W )
% 0.19/0.49 = ( Y @ W ) ) ) ) ).
% 0.19/0.49
% 0.19/0.49 %----Modal operators not, or, box, Pi
% 0.19/0.49 thf(mnot_type,type,
% 0.19/0.49 mnot: ( $i > $o ) > $i > $o ).
% 0.19/0.49
% 0.19/0.49 thf(mnot,definition,
% 0.19/0.49 ( mnot
% 0.19/0.49 = ( ^ [Phi: $i > $o,W: $i] :
% 0.19/0.49 ~ ( Phi @ W ) ) ) ).
% 0.19/0.49
% 0.19/0.49 thf(mor_type,type,
% 0.19/0.49 mor: ( $i > $o ) > ( $i > $o ) > $i > $o ).
% 0.19/0.49
% 0.19/0.49 thf(mor,definition,
% 0.19/0.49 ( mor
% 0.19/0.49 = ( ^ [Phi: $i > $o,Psi: $i > $o,W: $i] :
% 0.19/0.49 ( ( Phi @ W )
% 0.19/0.49 | ( Psi @ W ) ) ) ) ).
% 0.19/0.49
% 0.19/0.49 thf(mbox_type,type,
% 0.19/0.49 mbox: ( $i > $i > $o ) > ( $i > $o ) > $i > $o ).
% 0.19/0.49
% 0.19/0.49 thf(mbox,definition,
% 0.19/0.49 ( mbox
% 0.19/0.49 = ( ^ [R: $i > $i > $o,Phi: $i > $o,W: $i] :
% 0.19/0.49 ! [V: $i] :
% 0.19/0.49 ( ~ ( R @ W @ V )
% 0.19/0.49 | ( Phi @ V ) ) ) ) ).
% 0.19/0.49
% 0.19/0.49 thf(mforall_prop_type,type,
% 0.19/0.49 mforall_prop: ( ( $i > $o ) > $i > $o ) > $i > $o ).
% 0.19/0.49
% 0.19/0.49 thf(mforall_prop,definition,
% 0.19/0.49 ( mforall_prop
% 0.19/0.49 = ( ^ [Phi: ( $i > $o ) > $i > $o,W: $i] :
% 0.19/0.49 ! [P: $i > $o] : ( Phi @ P @ W ) ) ) ).
% 0.19/0.49
% 0.19/0.49 %----Further modal operators
% 0.19/0.49 thf(mtrue_type,type,
% 0.19/0.49 mtrue: $i > $o ).
% 0.19/0.49
% 0.19/0.49 thf(mtrue,definition,
% 0.19/0.49 ( mtrue
% 0.19/0.49 = ( ^ [W: $i] : $true ) ) ).
% 0.19/0.49
% 0.19/0.49 thf(mfalse_type,type,
% 0.19/0.49 mfalse: $i > $o ).
% 0.19/0.49
% 0.19/0.49 thf(mfalse,definition,
% 0.19/0.49 ( mfalse
% 0.19/0.49 = ( mnot @ mtrue ) ) ).
% 0.19/0.49
% 0.19/0.49 thf(mand_type,type,
% 0.19/0.49 mand: ( $i > $o ) > ( $i > $o ) > $i > $o ).
% 0.19/0.49
% 0.19/0.49 thf(mand,definition,
% 0.19/0.49 ( mand
% 0.19/0.49 = ( ^ [Phi: $i > $o,Psi: $i > $o] : ( mnot @ ( mor @ ( mnot @ Phi ) @ ( mnot @ Psi ) ) ) ) ) ).
% 0.19/0.49
% 0.19/0.49 thf(mimplies_type,type,
% 0.19/0.49 mimplies: ( $i > $o ) > ( $i > $o ) > $i > $o ).
% 0.19/0.49
% 0.19/0.49 thf(mimplies,definition,
% 0.19/0.49 ( mimplies
% 0.19/0.49 = ( ^ [Phi: $i > $o,Psi: $i > $o] : ( mor @ ( mnot @ Phi ) @ Psi ) ) ) ).
% 0.19/0.49
% 0.19/0.49 thf(mimplied_type,type,
% 0.19/0.49 mimplied: ( $i > $o ) > ( $i > $o ) > $i > $o ).
% 0.19/0.49
% 0.19/0.49 thf(mimplied,definition,
% 0.19/0.49 ( mimplied
% 0.19/0.49 = ( ^ [Phi: $i > $o,Psi: $i > $o] : ( mor @ ( mnot @ Psi ) @ Phi ) ) ) ).
% 0.19/0.49
% 0.19/0.49 thf(mequiv_type,type,
% 0.19/0.49 mequiv: ( $i > $o ) > ( $i > $o ) > $i > $o ).
% 0.19/0.49
% 0.19/0.49 thf(mequiv,definition,
% 0.19/0.49 ( mequiv
% 0.19/0.49 = ( ^ [Phi: $i > $o,Psi: $i > $o] : ( mand @ ( mimplies @ Phi @ Psi ) @ ( mimplies @ Psi @ Phi ) ) ) ) ).
% 0.19/0.49
% 0.19/0.49 thf(mxor_type,type,
% 0.19/0.49 mxor: ( $i > $o ) > ( $i > $o ) > $i > $o ).
% 0.19/0.49
% 0.19/0.49 thf(mxor,definition,
% 0.19/0.49 ( mxor
% 0.19/0.49 = ( ^ [Phi: $i > $o,Psi: $i > $o] : ( mnot @ ( mequiv @ Phi @ Psi ) ) ) ) ).
% 0.19/0.49
% 0.19/0.49 thf(mdia_type,type,
% 0.19/0.49 mdia: ( $i > $i > $o ) > ( $i > $o ) > $i > $o ).
% 0.19/0.49
% 0.19/0.49 thf(mdia,definition,
% 0.19/0.49 ( mdia
% 0.19/0.49 = ( ^ [R: $i > $i > $o,Phi: $i > $o] : ( mnot @ ( mbox @ R @ ( mnot @ Phi ) ) ) ) ) ).
% 0.19/0.49
% 0.19/0.49 %--- (new for cumulative)
% 0.19/0.49 %---Declaration of existence predicate for simulating cumulative domain
% 0.19/0.49 thf(exists_in_world_type,type,
% 0.19/0.49 exists_in_world: mu > $i > $o ).
% 0.19/0.49
% 0.19/0.49 %----The domains are non-empty
% 0.19/0.49 thf(nonempty_ax,axiom,
% 0.19/0.49 ! [V: $i] :
% 0.19/0.49 ? [X: mu] : ( exists_in_world @ X @ V ) ).
% 0.19/0.49
% 0.19/0.49 thf(mforall_ind_type,type,
% 0.19/0.49 mforall_ind: ( mu > $i > $o ) > $i > $o ).
% 0.19/0.49
% 0.19/0.49 %--- (new for cumulative)
% 0.19/0.49 thf(mforall_ind,definition,
% 0.19/0.49 ( mforall_ind
% 0.19/0.49 = ( ^ [Phi: mu > $i > $o,W: $i] :
% 0.19/0.49 ! [X: mu] :
% 0.19/0.49 ( ( exists_in_world @ X @ W )
% 0.19/0.49 => ( Phi @ X @ W ) ) ) ) ).
% 0.19/0.49
% 0.19/0.49 %thf(mforall_ind,definition,
% 0.19/0.49 % ( mforall_ind
% 0.19/0.49 % = ( ^ [Phi: mu > $i > $o,W: $i] :
% 0.19/0.49 % ! [X: mu] :
% 0.19/0.49 % ( Phi @ X @ W ) ) )).
% 0.19/0.49
% 0.19/0.49 thf(mexists_ind_type,type,
% 0.19/0.49 mexists_ind: ( mu > $i > $o ) > $i > $o ).
% 0.19/0.49
% 0.19/0.49 thf(mexists_ind,definition,
% 0.19/0.49 ( mexists_ind
% 0.19/0.49 = ( ^ [Phi: mu > $i > $o] :
% 0.19/0.49 ( mnot
% 0.19/0.49 @ ( mforall_ind
% 0.19/0.49 @ ^ [X: mu] : ( mnot @ ( Phi @ X ) ) ) ) ) ) ).
% 0.19/0.49
% 0.19/0.49 thf(mexists_prop_type,type,
% 0.19/0.49 mexists_prop: ( ( $i > $o ) > $i > $o ) > $i > $o ).
% 0.19/0.49
% 0.19/0.49 thf(mexists_prop,definition,
% 0.19/0.49 ( mexists_prop
% 0.19/0.49 = ( ^ [Phi: ( $i > $o ) > $i > $o] :
% 0.19/0.49 ( mnot
% 0.19/0.49 @ ( mforall_prop
% 0.19/0.49 @ ^ [P: $i > $o] : ( mnot @ ( Phi @ P ) ) ) ) ) ) ).
% 0.19/0.49
% 0.19/0.49 %----Definition of properties of accessibility relations
% 0.19/0.49 thf(mreflexive_type,type,
% 0.19/0.49 mreflexive: ( $i > $i > $o ) > $o ).
% 0.19/0.49
% 0.19/0.49 thf(mreflexive,definition,
% 0.19/0.49 ( mreflexive
% 0.19/0.49 = ( ^ [R: $i > $i > $o] :
% 0.19/0.49 ! [S: $i] : ( R @ S @ S ) ) ) ).
% 0.19/0.49
% 0.19/0.49 thf(msymmetric_type,type,
% 0.19/0.49 msymmetric: ( $i > $i > $o ) > $o ).
% 0.19/0.49
% 0.19/0.49 thf(msymmetric,definition,
% 0.19/0.49 ( msymmetric
% 0.19/0.49 = ( ^ [R: $i > $i > $o] :
% 0.19/0.49 ! [S: $i,T: $i] :
% 0.19/0.49 ( ( R @ S @ T )
% 0.19/0.49 => ( R @ T @ S ) ) ) ) ).
% 0.19/0.49
% 0.19/0.49 thf(mserial_type,type,
% 0.19/0.49 mserial: ( $i > $i > $o ) > $o ).
% 0.19/0.49
% 0.19/0.49 thf(mserial,definition,
% 0.19/0.49 ( mserial
% 0.19/0.49 = ( ^ [R: $i > $i > $o] :
% 0.19/0.49 ! [S: $i] :
% 0.19/0.49 ? [T: $i] : ( R @ S @ T ) ) ) ).
% 0.19/0.49
% 0.19/0.49 thf(mtransitive_type,type,
% 0.19/0.49 mtransitive: ( $i > $i > $o ) > $o ).
% 0.19/0.49
% 0.19/0.49 thf(mtransitive,definition,
% 0.19/0.49 ( mtransitive
% 0.19/0.49 = ( ^ [R: $i > $i > $o] :
% 0.19/0.49 ! [S: $i,T: $i,U: $i] :
% 0.19/0.49 ( ( ( R @ S @ T )
% 0.19/0.49 & ( R @ T @ U ) )
% 0.19/0.49 => ( R @ S @ U ) ) ) ) ).
% 0.19/0.49
% 0.19/0.49 thf(meuclidean_type,type,
% 0.19/0.49 meuclidean: ( $i > $i > $o ) > $o ).
% 0.19/0.49
% 0.19/0.49 thf(meuclidean,definition,
% 0.19/0.49 ( meuclidean
% 0.19/0.49 = ( ^ [R: $i > $i > $o] :
% 0.19/0.49 ! [S: $i,T: $i,U: $i] :
% 0.19/0.49 ( ( ( R @ S @ T )
% 0.19/0.49 & ( R @ S @ U ) )
% 0.19/0.49 => ( R @ T @ U ) ) ) ) ).
% 0.19/0.49
% 0.19/0.49 thf(mpartially_functional_type,type,
% 0.19/0.49 mpartially_functional: ( $i > $i > $o ) > $o ).
% 0.19/0.49
% 0.19/0.49 thf(mpartially_functional,definition,
% 0.19/0.49 ( mpartially_functional
% 0.19/0.49 = ( ^ [R: $i > $i > $o] :
% 0.19/0.49 ! [S: $i,T: $i,U: $i] :
% 0.19/0.49 ( ( ( R @ S @ T )
% 0.19/0.49 & ( R @ S @ U ) )
% 0.19/0.49 => ( T = U ) ) ) ) ).
% 0.19/0.49
% 0.19/0.49 thf(mfunctional_type,type,
% 0.19/0.49 mfunctional: ( $i > $i > $o ) > $o ).
% 0.19/0.49
% 0.19/0.49 thf(mfunctional,definition,
% 0.19/0.49 ( mfunctional
% 0.19/0.49 = ( ^ [R: $i > $i > $o] :
% 0.19/0.49 ! [S: $i] :
% 0.19/0.49 ? [T: $i] :
% 0.19/0.49 ( ( R @ S @ T )
% 0.19/0.49 & ! [U: $i] :
% 0.19/0.49 ( ( R @ S @ U )
% 0.19/0.49 => ( T = U ) ) ) ) ) ).
% 0.19/0.49
% 0.19/0.49 thf(mweakly_dense_type,type,
% 0.19/0.49 mweakly_dense: ( $i > $i > $o ) > $o ).
% 0.19/0.49
% 0.19/0.49 thf(mweakly_dense,definition,
% 0.19/0.49 ( mweakly_dense
% 0.19/0.49 = ( ^ [R: $i > $i > $o] :
% 0.19/0.49 ! [S: $i,T: $i,U: $i] :
% 0.19/0.49 ( ( R @ S @ T )
% 0.19/0.49 => ? [U: $i] :
% 0.19/0.49 ( ( R @ S @ U )
% 0.19/0.49 & ( R @ U @ T ) ) ) ) ) ).
% 0.19/0.49
% 0.19/0.49 thf(mweakly_connected_type,type,
% 0.19/0.49 mweakly_connected: ( $i > $i > $o ) > $o ).
% 0.19/0.49
% 0.19/0.49 thf(mweakly_connected,definition,
% 0.19/0.49 ( mweakly_connected
% 0.19/0.49 = ( ^ [R: $i > $i > $o] :
% 0.19/0.49 ! [S: $i,T: $i,U: $i] :
% 0.19/0.49 ( ( ( R @ S @ T )
% 0.19/0.49 & ( R @ S @ U ) )
% 0.19/0.49 => ( ( R @ T @ U )
% 0.19/0.49 | ( T = U )
% 0.19/0.49 | ( R @ U @ T ) ) ) ) ) ).
% 0.19/0.49
% 0.19/0.49 thf(mweakly_directed_type,type,
% 0.19/0.49 mweakly_directed: ( $i > $i > $o ) > $o ).
% 0.19/0.49
% 0.19/0.49 thf(mweakly_directed,definition,
% 0.19/0.49 ( mweakly_directed
% 0.19/0.49 = ( ^ [R: $i > $i > $o] :
% 0.19/0.49 ! [S: $i,T: $i,U: $i] :
% 0.19/0.49 ( ( ( R @ S @ T )
% 0.19/0.49 & ( R @ S @ U ) )
% 0.19/0.49 => ? [V: $i] :
% 0.19/0.49 ( ( R @ T @ V )
% 0.19/0.49 & ( R @ U @ V ) ) ) ) ) ).
% 0.19/0.49
% 0.19/0.49 %----Definition of validity
% 0.19/0.49 thf(mvalid_type,type,
% 0.19/0.49 mvalid: ( $i > $o ) > $o ).
% 0.19/0.49
% 0.19/0.49 thf(mvalid,definition,
% 0.19/0.49 ( mvalid
% 0.19/0.49 = ( ^ [Phi: $i > $o] :
% 0.19/0.49 ! [W: $i] : ( Phi @ W ) ) ) ).
% 0.19/0.49
% 0.19/0.49 %----Definition of satisfiability
% 0.19/0.49 thf(msatisfiable_type,type,
% 0.19/0.49 msatisfiable: ( $i > $o ) > $o ).
% 0.19/0.49
% 0.19/0.49 thf(msatisfiable,definition,
% 0.19/0.49 ( msatisfiable
% 0.19/0.49 = ( ^ [Phi: $i > $o] :
% 0.19/0.49 ? [W: $i] : ( Phi @ W ) ) ) ).
% 0.19/0.49
% 0.19/0.49 %----Definition of countersatisfiability
% 0.19/0.49 thf(mcountersatisfiable_type,type,
% 0.19/0.49 mcountersatisfiable: ( $i > $o ) > $o ).
% 0.19/0.49
% 0.19/0.49 thf(mcountersatisfiable,definition,
% 0.19/0.49 ( mcountersatisfiable
% 0.19/0.49 = ( ^ [Phi: $i > $o] :
% 0.19/0.49 ? [W: $i] :
% 0.19/0.49 ~ ( Phi @ W ) ) ) ).
% 0.19/0.49
% 0.19/0.49 %----Definition of invalidity
% 0.19/0.49 thf(minvalid_type,type,
% 0.19/0.49 minvalid: ( $i > $o ) > $o ).
% 0.19/0.49
% 0.19/0.49 thf(minvalid,definition,
% 0.19/0.49 ( minvalid
% 0.19/0.49 = ( ^ [Phi: $i > $o] :
% 0.19/0.49 ! [W: $i] :
% 0.19/0.49 ~ ( Phi @ W ) ) ) ).
% 0.19/0.49
% 0.19/0.49 %------------------------------------------------------------------------------
% 0.19/0.49 %------------------------------------------------------------------------------
% 0.19/0.49 %----We reserve an accessibility relation constant rel_s4
% 0.19/0.49 thf(rel_s4_type,type,
% 0.19/0.49 rel_s4: $i > $i > $o ).
% 0.19/0.49
% 0.19/0.49 %----We define mbox_s4 and mdia_s4 based on rel_s4
% 0.19/0.49 thf(mbox_s4_type,type,
% 0.19/0.49 mbox_s4: ( $i > $o ) > $i > $o ).
% 0.19/0.49
% 0.19/0.49 thf(mbox_s4,definition,
% 0.19/0.49 ( mbox_s4
% 0.19/0.49 = ( ^ [Phi: $i > $o,W: $i] :
% 0.19/0.49 ! [V: $i] :
% 0.19/0.49 ( ~ ( rel_s4 @ W @ V )
% 0.19/0.49 | ( Phi @ V ) ) ) ) ).
% 0.19/0.49
% 0.19/0.49 thf(mdia_s4_type,type,
% 0.19/0.49 mdia_s4: ( $i > $o ) > $i > $o ).
% 0.19/0.49
% 0.19/0.49 thf(mdia_s4,definition,
% 0.19/0.49 ( mdia_s4
% 0.19/0.49 = ( ^ [Phi: $i > $o] : ( mnot @ ( mbox_s4 @ ( mnot @ Phi ) ) ) ) ) ).
% 0.19/0.49
% 0.19/0.49 %----We have now two options for stating the B conditions:
% 0.19/0.49 %----We can (i) directly formulate conditions for the accessibility relation
% 0.19/0.49 %----constant or we can (ii) state corresponding axioms. We here prefer (i)
% 0.19/0.49 thf(a1,axiom,
% 0.19/0.49 mreflexive @ rel_s4 ).
% 0.19/0.49
% 0.19/0.49 thf(a2,axiom,
% 0.19/0.49 mtransitive @ rel_s4 ).
% 0.19/0.49
% 0.19/0.49 %------------------------------------------------------------------------------
% 0.19/0.49 %------------------------------------------------------------------------------
% 0.19/0.49 thf(cumulative_ax,axiom,
% 0.19/0.49 ! [X: mu,V: $i,W: $i] :
% 0.19/0.49 ( ( ( exists_in_world @ X @ V )
% 0.19/0.49 & ( rel_s4 @ V @ W ) )
% 0.19/0.49 => ( exists_in_world @ X @ W ) ) ).
% 0.19/0.49
% 0.19/0.49 %------------------------------------------------------------------------------
% 0.19/0.49 %------------------------------------------------------------------------------
% 0.19/0.49 thf(string_type,type,
% 0.19/0.49 string: mu > $i > $o ).
% 0.19/0.49
% 0.19/0.49 thf(in_type,type,
% 0.19/0.49 in: mu > mu > mu > $i > $o ).
% 0.19/0.49
% 0.19/0.49 thf(do_type,type,
% 0.19/0.49 do: mu > mu > mu > $i > $o ).
% 0.19/0.49
% 0.19/0.49 thf(number_type,type,
% 0.19/0.49 number: mu > mu > $i > $o ).
% 0.19/0.49
% 0.19/0.49 thf(entry_box_type,type,
% 0.19/0.49 entry_box: mu > $i > $o ).
% 0.19/0.49
% 0.19/0.49 thf(userid_type,type,
% 0.19/0.49 userid: mu > mu > $i > $o ).
% 0.19/0.49
% 0.19/0.49 thf(one_type,type,
% 0.19/0.49 one: mu ).
% 0.19/0.49
% 0.19/0.49 thf(existence_of_one_ax,axiom,
% 0.19/0.49 ! [V: $i] : ( exists_in_world @ one @ V ) ).
% 0.19/0.49
% 0.19/0.49 thf(u_type,type,
% 0.19/0.49 u: mu ).
% 0.19/0.49
% 0.19/0.49 thf(existence_of_u_ax,axiom,
% 0.19/0.49 ! [V: $i] : ( exists_in_world @ u @ V ) ).
% 0.19/0.49
% 0.19/0.49 thf(ax1,axiom,
% 0.19/0.49 ( mvalid
% 0.19/0.49 @ ( mbox_s4
% 0.19/0.49 @ ( mexists_ind
% 0.19/0.49 @ ^ [I: mu] : ( mbox_s4 @ ( mand @ ( userid @ u @ I ) @ ( string @ I ) ) ) ) ) ) ).
% 0.19/0.49
% 0.19/0.49 thf(ax2,axiom,
% 0.19/0.49 ( mvalid
% 0.19/0.49 @ ( mexists_ind
% 0.19/0.49 @ ^ [B: mu] : ( mbox_s4 @ ( mand @ ( entry_box @ B ) @ ( number @ B @ one ) ) ) ) ) ).
% 0.19/0.49
% 0.19/0.49 thf(ax3,axiom,
% 0.19/0.49 ( mvalid
% 0.19/0.49 @ ( mbox_s4
% 0.19/0.49 @ ( mforall_ind
% 0.19/0.49 @ ^ [S: mu] :
% 0.19/0.49 ( mforall_ind
% 0.19/0.49 @ ^ [I: mu] :
% 0.19/0.49 ( mforall_ind
% 0.19/0.49 @ ^ [B: mu] :
% 0.19/0.49 ( mimplies @ ( mand @ ( string @ I ) @ ( entry_box @ B ) )
% 0.19/0.50 @ ( mexists_ind
% 0.19/0.50 @ ^ [A: mu] :
% 0.19/0.50 ( mbox_s4
% 0.19/0.50 @ ( mforall_ind
% 0.19/0.50 @ ^ [S2: mu] : ( mimplies @ ( do @ S @ A @ S2 ) @ ( in @ I @ B @ S2 ) ) ) ) ) ) ) ) ) ) ) ).
% 0.19/0.50
% 0.19/0.50 thf(con,conjecture,
% 0.19/0.50 ( mvalid
% 0.19/0.50 @ ( mbox_s4
% 0.19/0.50 @ ( mexists_ind
% 0.19/0.50 @ ^ [I: mu] :
% 0.19/0.50 ( mexists_ind
% 0.19/0.50 @ ^ [B: mu] :
% 0.19/0.50 ( mexists_ind
% 0.19/0.50 @ ^ [A: mu] :
% 0.19/0.50 ( mexists_ind
% 0.19/0.50 @ ^ [S: mu] :
% 0.19/0.50 ( mand @ ( mbox_s4 @ ( mand @ ( userid @ u @ I ) @ ( mand @ ( entry_box @ B ) @ ( number @ B @ one ) ) ) )
% 0.19/0.50 @ ( mbox_s4
% 0.19/0.50 @ ( mforall_ind
% 0.19/0.50 @ ^ [S2: mu] : ( mimplies @ ( do @ S @ A @ S2 ) @ ( in @ I @ B @ S2 ) ) ) ) ) ) ) ) ) ) ) ).
% 0.19/0.50
% 0.19/0.50 %------------------------------------------------------------------------------
% 0.19/0.50 ------- convert to smt2 : /export/starexec/sandbox2/tmp/tmp.lWF6okqP9G/cvc5---1.0.5_1569.p...
% 0.19/0.50 (declare-sort $$unsorted 0)
% 0.19/0.50 (declare-sort tptp.mu 0)
% 0.19/0.50 (declare-fun tptp.qmltpeq (tptp.mu tptp.mu $$unsorted) Bool)
% 0.19/0.50 (declare-fun tptp.meq_prop ((-> $$unsorted Bool) (-> $$unsorted Bool) $$unsorted) Bool)
% 0.19/0.50 (assert (= tptp.meq_prop (lambda ((X (-> $$unsorted Bool)) (Y (-> $$unsorted Bool)) (W $$unsorted)) (= (@ X W) (@ Y W)))))
% 0.19/0.50 (declare-fun tptp.mnot ((-> $$unsorted Bool) $$unsorted) Bool)
% 0.19/0.50 (assert (= tptp.mnot (lambda ((Phi (-> $$unsorted Bool)) (W $$unsorted)) (not (@ Phi W)))))
% 0.19/0.50 (declare-fun tptp.mor ((-> $$unsorted Bool) (-> $$unsorted Bool) $$unsorted) Bool)
% 0.19/0.50 (assert (= tptp.mor (lambda ((Phi (-> $$unsorted Bool)) (Psi (-> $$unsorted Bool)) (W $$unsorted)) (or (@ Phi W) (@ Psi W)))))
% 0.19/0.50 (declare-fun tptp.mbox ((-> $$unsorted $$unsorted Bool) (-> $$unsorted Bool) $$unsorted) Bool)
% 0.19/0.50 (assert (= tptp.mbox (lambda ((R (-> $$unsorted $$unsorted Bool)) (Phi (-> $$unsorted Bool)) (W $$unsorted)) (forall ((V $$unsorted)) (or (not (@ (@ R W) V)) (@ Phi V))))))
% 0.19/0.50 (declare-fun tptp.mforall_prop ((-> (-> $$unsorted Bool) $$unsorted Bool) $$unsorted) Bool)
% 0.19/0.50 (assert (= tptp.mforall_prop (lambda ((Phi (-> (-> $$unsorted Bool) $$unsorted Bool)) (W $$unsorted)) (forall ((P (-> $$unsorted Bool))) (@ (@ Phi P) W)))))
% 0.19/0.50 (declare-fun tptp.mtrue ($$unsorted) Bool)
% 0.19/0.50 (assert (= tptp.mtrue (lambda ((W $$unsorted)) true)))
% 0.19/0.50 (declare-fun tptp.mfalse ($$unsorted) Bool)
% 0.19/0.50 (assert (= tptp.mfalse (@ tptp.mnot tptp.mtrue)))
% 0.19/0.50 (declare-fun tptp.mand ((-> $$unsorted Bool) (-> $$unsorted Bool) $$unsorted) Bool)
% 0.19/0.50 (assert (= tptp.mand (lambda ((Phi (-> $$unsorted Bool)) (Psi (-> $$unsorted Bool)) (__flatten_var_0 $$unsorted)) (@ (@ tptp.mnot (@ (@ tptp.mor (@ tptp.mnot Phi)) (@ tptp.mnot Psi))) __flatten_var_0))))
% 0.19/0.50 (declare-fun tptp.mimplies ((-> $$unsorted Bool) (-> $$unsorted Bool) $$unsorted) Bool)
% 0.19/0.50 (assert (= tptp.mimplies (lambda ((Phi (-> $$unsorted Bool)) (Psi (-> $$unsorted Bool)) (__flatten_var_0 $$unsorted)) (@ (@ (@ tptp.mor (@ tptp.mnot Phi)) Psi) __flatten_var_0))))
% 0.19/0.50 (declare-fun tptp.mimplied ((-> $$unsorted Bool) (-> $$unsorted Bool) $$unsorted) Bool)
% 0.19/0.50 (assert (= tptp.mimplied (lambda ((Phi (-> $$unsorted Bool)) (Psi (-> $$unsorted Bool)) (__flatten_var_0 $$unsorted)) (@ (@ (@ tptp.mor (@ tptp.mnot Psi)) Phi) __flatten_var_0))))
% 0.19/0.50 (declare-fun tptp.mequiv ((-> $$unsorted Bool) (-> $$unsorted Bool) $$unsorted) Bool)
% 0.19/0.50 (assert (= tptp.mequiv (lambda ((Phi (-> $$unsorted Bool)) (Psi (-> $$unsorted Bool)) (__flatten_var_0 $$unsorted)) (@ (@ (@ tptp.mand (@ (@ tptp.mimplies Phi) Psi)) (@ (@ tptp.mimplies Psi) Phi)) __flatten_var_0))))
% 0.19/0.50 (declare-fun tptp.mxor ((-> $$unsorted Bool) (-> $$unsorted Bool) $$unsorted) Bool)
% 0.19/0.50 (assert (= tptp.mxor (lambda ((Phi (-> $$unsorted Bool)) (Psi (-> $$unsorted Bool)) (__flatten_var_0 $$unsorted)) (@ (@ tptp.mnot (@ (@ tptp.mequiv Phi) Psi)) __flatten_var_0))))
% 0.19/0.50 (declare-fun tptp.mdia ((-> $$unsorted $$unsorted Bool) (-> $$unsorted Bool) $$unsorted) Bool)
% 0.19/0.50 (assert (= tptp.mdia (lambda ((R (-> $$unsorted $$unsorted Bool)) (Phi (-> $$unsorted Bool)) (__flatten_var_0 $$unsorted)) (@ (@ tptp.mnot (@ (@ tptp.mbox R) (@ tptp.mnot Phi))) __flatten_var_0))))
% 0.19/0.50 (declare-fun tptp.exists_in_world (tptp.mu $$unsorted) Bool)
% 0.19/0.50 (assert (forall ((V $$unsorted)) (exists ((X tptp.mu)) (@ (@ tptp.exists_in_world X) V))))
% 0.19/0.50 (declare-fun tptp.mforall_ind ((-> tptp.mu $$unsorted Bool) $$unsorted) Bool)
% 0.19/0.50 (assert (= tptp.mforall_ind (lambda ((Phi (-> tptp.mu $$unsorted Bool)) (W $$unsorted)) (forall ((X tptp.mu)) (=> (@ (@ tptp.exists_in_world X) W) (@ (@ Phi X) W))))))
% 0.19/0.50 (declare-fun tptp.mexists_ind ((-> tptp.mu $$unsorted Bool) $$unsorted) Bool)
% 0.19/0.50 (assert (= tptp.mexists_ind (lambda ((Phi (-> tptp.mu $$unsorted Bool)) (__flatten_var_0 $$unsorted)) (@ (@ tptp.mnot (@ tptp.mforall_ind (lambda ((X tptp.mu) (__flatten_var_0 $$unsorted)) (@ (@ tptp.mnot (@ Phi X)) __flatten_var_0)))) __flatten_var_0))))
% 0.19/0.50 (declare-fun tptp.mexists_prop ((-> (-> $$unsorted Bool) $$unsorted Bool) $$unsorted) Bool)
% 0.19/0.50 (assert (= tptp.mexists_prop (lambda ((Phi (-> (-> $$unsorted Bool) $$unsorted Bool)) (__flatten_var_0 $$unsorted)) (@ (@ tptp.mnot (@ tptp.mforall_prop (lambda ((P (-> $$unsorted Bool)) (__flatten_var_0 $$unsorted)) (@ (@ tptp.mnot (@ Phi P)) __flatten_var_0)))) __flatten_var_0))))
% 0.19/0.50 (declare-fun tptp.mreflexive ((-> $$unsorted $$unsorted Bool)) Bool)
% 0.19/0.50 (assert (= tptp.mreflexive (lambda ((R (-> $$unsorted $$unsorted Bool))) (forall ((S $$unsorted)) (@ (@ R S) S)))))
% 0.19/0.50 (declare-fun tptp.msymmetric ((-> $$unsorted $$unsorted Bool)) Bool)
% 0.19/0.50 (assert (= tptp.msymmetric (lambda ((R (-> $$unsorted $$unsorted Bool))) (forall ((S $$unsorted) (T $$unsorted)) (=> (@ (@ R S) T) (@ (@ R T) S))))))
% 0.19/0.50 (declare-fun tptp.mserial ((-> $$unsorted $$unsorted Bool)) Bool)
% 0.19/0.50 (assert (= tptp.mserial (lambda ((R (-> $$unsorted $$unsorted Bool))) (forall ((S $$unsorted)) (exists ((T $$unsorted)) (@ (@ R S) T))))))
% 0.19/0.50 (declare-fun tptp.mtransitive ((-> $$unsorted $$unsorted Bool)) Bool)
% 0.19/0.50 (assert (= tptp.mtransitive (lambda ((R (-> $$unsorted $$unsorted Bool))) (forall ((S $$unsorted) (T $$unsorted) (U $$unsorted)) (let ((_let_1 (@ R S))) (=> (and (@ _let_1 T) (@ (@ R T) U)) (@ _let_1 U)))))))
% 0.19/0.50 (declare-fun tptp.meuclidean ((-> $$unsorted $$unsorted Bool)) Bool)
% 0.19/0.50 (assert (= tptp.meuclidean (lambda ((R (-> $$unsorted $$unsorted Bool))) (forall ((S $$unsorted) (T $$unsorted) (U $$unsorted)) (let ((_let_1 (@ R S))) (=> (and (@ _let_1 T) (@ _let_1 U)) (@ (@ R T) U)))))))
% 0.19/0.50 (declare-fun tptp.mpartially_functional ((-> $$unsorted $$unsorted Bool)) Bool)
% 0.19/0.50 (assert (= tptp.mpartially_functional (lambda ((R (-> $$unsorted $$unsorted Bool))) (forall ((S $$unsorted) (T $$unsorted) (U $$unsorted)) (let ((_let_1 (@ R S))) (=> (and (@ _let_1 T) (@ _let_1 U)) (= T U)))))))
% 0.19/0.50 (declare-fun tptp.mfunctional ((-> $$unsorted $$unsorted Bool)) Bool)
% 0.19/0.50 (assert (= tptp.mfunctional (lambda ((R (-> $$unsorted $$unsorted Bool))) (forall ((S $$unsorted)) (exists ((T $$unsorted)) (and (@ (@ R S) T) (forall ((U $$unsorted)) (=> (@ (@ R S) U) (= T U)))))))))
% 0.19/0.50 (declare-fun tptp.mweakly_dense ((-> $$unsorted $$unsorted Bool)) Bool)
% 0.19/0.50 (assert (= tptp.mweakly_dense (lambda ((R (-> $$unsorted $$unsorted Bool))) (forall ((S $$unsorted) (T $$unsorted) (U $$unsorted)) (=> (@ (@ R S) T) (exists ((U $$unsorted)) (and (@ (@ R S) U) (@ (@ R U) T))))))))
% 0.19/0.50 (declare-fun tptp.mweakly_connected ((-> $$unsorted $$unsorted Bool)) Bool)
% 0.19/0.50 (assert (= tptp.mweakly_connected (lambda ((R (-> $$unsorted $$unsorted Bool))) (forall ((S $$unsorted) (T $$unsorted) (U $$unsorted)) (let ((_let_1 (@ R S))) (=> (and (@ _let_1 T) (@ _let_1 U)) (or (@ (@ R T) U) (= T U) (@ (@ R U) T))))))))
% 0.19/0.50 (declare-fun tptp.mweakly_directed ((-> $$unsorted $$unsorted Bool)) Bool)
% 0.19/0.50 (assert (= tptp.mweakly_directed (lambda ((R (-> $$unsorted $$unsorted Bool))) (forall ((S $$unsorted) (T $$unsorted) (U $$unsorted)) (let ((_let_1 (@ R S))) (=> (and (@ _let_1 T) (@ _let_1 U)) (exists ((V $$unsorted)) (and (@ (@ R T) V) (@ (@ R U) V)))))))))
% 0.19/0.50 (declare-fun tptp.mvalid ((-> $$unsorted Bool)) Bool)
% 0.19/0.50 (assert (= tptp.mvalid (lambda ((Phi (-> $$unsorted Bool))) (forall ((W $$unsorted)) (@ Phi W)))))
% 0.19/0.50 (declare-fun tptp.msatisfiable ((-> $$unsorted Bool)) Bool)
% 0.19/0.50 (assert (= tptp.msatisfiable (lambda ((Phi (-> $$unsorted Bool))) (exists ((W $$unsorted)) (@ Phi W)))))
% 35.62/35.86 (declare-fun tptp.mcountersatisfiable ((-> $$unsorted Bool)) Bool)
% 35.62/35.86 (assert (= tptp.mcountersatisfiable (lambda ((Phi (-> $$unsorted Bool))) (exists ((W $$unsorted)) (not (@ Phi W))))))
% 35.62/35.86 (declare-fun tptp.minvalid ((-> $$unsorted Bool)) Bool)
% 35.62/35.86 (assert (= tptp.minvalid (lambda ((Phi (-> $$unsorted Bool))) (forall ((W $$unsorted)) (not (@ Phi W))))))
% 35.62/35.86 (declare-fun tptp.rel_s4 ($$unsorted $$unsorted) Bool)
% 35.62/35.86 (declare-fun tptp.mbox_s4 ((-> $$unsorted Bool) $$unsorted) Bool)
% 35.62/35.86 (assert (= tptp.mbox_s4 (lambda ((Phi (-> $$unsorted Bool)) (W $$unsorted)) (forall ((V $$unsorted)) (or (not (@ (@ tptp.rel_s4 W) V)) (@ Phi V))))))
% 35.62/35.86 (declare-fun tptp.mdia_s4 ((-> $$unsorted Bool) $$unsorted) Bool)
% 35.62/35.86 (assert (= tptp.mdia_s4 (lambda ((Phi (-> $$unsorted Bool)) (__flatten_var_0 $$unsorted)) (@ (@ tptp.mnot (@ tptp.mbox_s4 (@ tptp.mnot Phi))) __flatten_var_0))))
% 35.62/35.86 (assert (@ tptp.mreflexive tptp.rel_s4))
% 35.62/35.86 (assert (@ tptp.mtransitive tptp.rel_s4))
% 35.62/35.86 (assert (forall ((X tptp.mu) (V $$unsorted) (W $$unsorted)) (let ((_let_1 (@ tptp.exists_in_world X))) (=> (and (@ _let_1 V) (@ (@ tptp.rel_s4 V) W)) (@ _let_1 W)))))
% 35.62/35.86 (declare-fun tptp.string (tptp.mu $$unsorted) Bool)
% 35.62/35.86 (declare-fun tptp.in (tptp.mu tptp.mu tptp.mu $$unsorted) Bool)
% 35.62/35.86 (declare-fun tptp.do (tptp.mu tptp.mu tptp.mu $$unsorted) Bool)
% 35.62/35.86 (declare-fun tptp.number (tptp.mu tptp.mu $$unsorted) Bool)
% 35.62/35.86 (declare-fun tptp.entry_box (tptp.mu $$unsorted) Bool)
% 35.62/35.86 (declare-fun tptp.userid (tptp.mu tptp.mu $$unsorted) Bool)
% 35.62/35.86 (declare-fun tptp.one () tptp.mu)
% 35.62/35.86 (assert (forall ((V $$unsorted)) (@ (@ tptp.exists_in_world tptp.one) V)))
% 35.62/35.86 (declare-fun tptp.u () tptp.mu)
% 35.62/35.86 (assert (forall ((V $$unsorted)) (@ (@ tptp.exists_in_world tptp.u) V)))
% 35.62/35.86 (assert (@ tptp.mvalid (@ tptp.mbox_s4 (@ tptp.mexists_ind (lambda ((I tptp.mu) (__flatten_var_0 $$unsorted)) (@ (@ tptp.mbox_s4 (@ (@ tptp.mand (@ (@ tptp.userid tptp.u) I)) (@ tptp.string I))) __flatten_var_0))))))
% 35.62/35.86 (assert (@ tptp.mvalid (@ tptp.mexists_ind (lambda ((B tptp.mu) (__flatten_var_0 $$unsorted)) (@ (@ tptp.mbox_s4 (@ (@ tptp.mand (@ tptp.entry_box B)) (@ (@ tptp.number B) tptp.one))) __flatten_var_0)))))
% 35.62/35.86 (assert (@ tptp.mvalid (@ tptp.mbox_s4 (@ tptp.mforall_ind (lambda ((S tptp.mu) (__flatten_var_0 $$unsorted)) (@ (@ tptp.mforall_ind (lambda ((I tptp.mu) (__flatten_var_0 $$unsorted)) (@ (@ tptp.mforall_ind (lambda ((B tptp.mu) (__flatten_var_0 $$unsorted)) (@ (@ (@ tptp.mimplies (@ (@ tptp.mand (@ tptp.string I)) (@ tptp.entry_box B))) (@ tptp.mexists_ind (lambda ((A tptp.mu) (__flatten_var_0 $$unsorted)) (@ (@ tptp.mbox_s4 (@ tptp.mforall_ind (lambda ((S2 tptp.mu) (__flatten_var_0 $$unsorted)) (@ (@ (@ tptp.mimplies (@ (@ (@ tptp.do S) A) S2)) (@ (@ (@ tptp.in I) B) S2)) __flatten_var_0)))) __flatten_var_0)))) __flatten_var_0))) __flatten_var_0))) __flatten_var_0))))))
% 35.62/35.86 (assert (not (@ tptp.mvalid (@ tptp.mbox_s4 (@ tptp.mexists_ind (lambda ((I tptp.mu) (__flatten_var_0 $$unsorted)) (@ (@ tptp.mexists_ind (lambda ((B tptp.mu) (__flatten_var_0 $$unsorted)) (@ (@ tptp.mexists_ind (lambda ((A tptp.mu) (__flatten_var_0 $$unsorted)) (@ (@ tptp.mexists_ind (lambda ((S tptp.mu) (__flatten_var_0 $$unsorted)) (@ (@ (@ tptp.mand (@ tptp.mbox_s4 (@ (@ tptp.mand (@ (@ tptp.userid tptp.u) I)) (@ (@ tptp.mand (@ tptp.entry_box B)) (@ (@ tptp.number B) tptp.one))))) (@ tptp.mbox_s4 (@ tptp.mforall_ind (lambda ((S2 tptp.mu) (__flatten_var_0 $$unsorted)) (@ (@ (@ tptp.mimplies (@ (@ (@ tptp.do S) A) S2)) (@ (@ (@ tptp.in I) B) S2)) __flatten_var_0))))) __flatten_var_0))) __flatten_var_0))) __flatten_var_0))) __flatten_var_0)))))))
% 35.62/35.86 (set-info :filename cvc5---1.0.5_1569)
% 35.62/35.86 (check-sat-assuming ( true ))
% 35.62/35.86 ------- get file name : TPTP file name is KRS272^7
% 35.62/35.86 ------- cvc5-thf : /export/starexec/sandbox2/solver/bin/cvc5---1.0.5_1569.smt2...
% 35.62/35.86 --- Run --ho-elim --full-saturate-quant at 10...
% 35.62/35.86 --- Run --ho-elim --no-e-matching --full-saturate-quant at 10...
% 35.62/35.86 --- Run --ho-elim --no-e-matching --enum-inst-sum --full-saturate-quant at 10...
% 35.62/35.86 --- Run --ho-elim --finite-model-find --uf-ss=no-minimal at 5...
% 35.62/35.86 --- Run --no-ho-matching --finite-model-find --uf-ss=no-minimal at 5...
% 35.65/36.30 % SZS status CounterSatisfiable for KRS272^7
% 35.65/36.30 % cvc5---1.0.5 exiting
% 35.65/36.30 % cvc5---1.0.5 exiting
%------------------------------------------------------------------------------